A Boolean proof of Richardson's theorem on graph theory
نویسندگان
چکیده
منابع مشابه
Another proof of Banaschewski's surjection theorem
We present a new proof of Banaschewski's theorem stating that the completion lift of a uniform surjection is a surjection. The new procedure allows to extend the fact (and, similarly, the related theorem on closed uniform sublocales of complete uniform frames) to quasi-uniformities ("not necessarily symmetric uniformities"). Further, we show how a (regular) Cauchy point on a closed uniform subl...
متن کاملA new proof for the Banach-Zarecki theorem: A light on integrability and continuity
To demonstrate more visibly the close relation between thecontinuity and integrability, a new proof for the Banach-Zareckitheorem is presented on the basis of the Radon-Nikodym theoremwhich emphasizes on measure-type properties of the Lebesgueintegral. The Banach-Zarecki theorem says that a real-valuedfunction $F$ is absolutely continuous on a finite closed intervalif and only if it is continuo...
متن کاملA Sard theorem for graph theory
The zero locus of a function f on a graph G is defined as the graph for which the vertex set consists of all complete subgraphs of G, on which f changes sign and where x, y are connected if one is contained in the other. For d-graphs, finite simple graphs for which every unit sphere is a d-sphere, the zero locus of (f − c) is a (d− 1)-graph for all c different from the range of f . If this Sard...
متن کاملHerbrand’s theorem and extractive proof theory
Proof theory has its historic origin in foundational issues centered around (relative) consistency proofs (Hilbert’s program). Since the 1950’s Georg Kreisel pushed for a shift of emphasis in proof theory towards the use of proof theoretic transformations (as developed in the course of Hilbert’s program) to analyze given proofs P e.g. of ineffectively proved ∀∃-statements C with the aim to extr...
متن کاملDomination Numbers on the Boolean Function Graph of a Graph
For any graph G, let V (G) and E(G) denote the vertex set and the edge set of G respectively. The Boolean function graph B(G, L(G),NINC) of G is a graph with vertex set V (G) ∪ E(G) and two vertices in B(G, L(G),NINC) are adjacent if and only if they correspond to two adjacent vertices of G, two adjacent edges of G or to a vertex and an edge not incident to it in G. For brevity, this graph is d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1978
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(78)91003-3